I/O-efficient join dependency testing, Loomis–Whitney join, and triangle enumeration
نویسندگان
چکیده
منابع مشابه
I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
Article history: Received 17 August 2015 Received in revised form 21 April 2016 Accepted 17 May 2016 Available online 11 June 2016
متن کاملAlgorithms for Efficient Top-Down Join Enumeration
For a DBMS that provides support for a declarative query language like SQL, the query optimizer is a crucial piece of software. The declarative nature of a query allows it to be translated into many equivalent evaluation plans. The process of choosing a suitable plan from all alternatives is known as query optimization. The basis of this choice are a cost model and statistics over the data. Ess...
متن کاملDeep Reinforcement Learning for Join Order Enumeration
Join order selection plays a significant role in query performance. Many modern database engine query optimizers use join order enumerators, cost models, and cardinality estimators to choose join orderings, each of which is based on painstakingly hand-tuned heuristics and formulae. Additionally, these systems typically employ static algorithms that ignore the end result (they do not “learn from...
متن کاملThe Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is produced. A memoizing structure was proposed in [McK93] to improve the re-use of common subexpression, thus improving the efficiency of the search considerably. However, a question that remained open is, what is the comple...
متن کاملFuzzy Join Dependency in Fuzzy Relational Databases
The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle imprecise data, they were extended to fuzzy relational databases so that uncertain, ambiguous, imprecise and part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2016
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2016.05.005